Budget Feasible Mechanisms Over Graphs

This paper studies the budget-feasible mechanism design over graphs, where a buyer wishes to procure items from sellers, and all participants (the sellers) can only directly interact with their neighbors during auction campaign. The problem for is use limited budget incentivize sellers propagate information neighbors, thereby more will be informed of item value procured. An impossibility result shows that large-market assumption necessary. We propose efficient diffusion mechanisms large markets simultaneously guarantee individual rationality, budget-feasibility, strong budget-balance, incentive-compatibility report private costs diffuse information. Moreover, proposed achieve logarithmic approximation total procured within factor optimal solution. Compared most related mechanisms, which do not take interactions among into account, our further other potential sellers. Meanwhile, existing focus on seller-centric auctions fail satisfy budget-feasibility buyer.